Net-based force-directed macrocell placement for wirelength optimization
نویسندگان
چکیده
We propose a net-based hierarchical macrocell placement such that “net placement” dictates the cell placement. The proposed approach has four phases. 1) Net clustering and net-level floorplanning phase: A weighted net dependency graph is built from the input register-transfer-level netlist. Clusters of nets are then formed by clique partitioning and a net-cluster level floorplan is obtained by simulated annealing. The floorplan defines the regions where the nets in each cluster must be routed. 2) Force-directed net placement phase: A force-directed net placement is performed which yields a coarse net-level placement without consideration for the cell placement. 3) Iterative net terminal and cell placement phase: A force-directed net and cell placement is performed iteratively. The terminals of a net are free to move under the influence of forces in the quest for optimal wire length. The cells with high net length cost may “jump” out of local minima by ignoring the rejection forces. The overlaps are reduced by employing electrostatic rejection forces. 4) Overlap Removal and input/output I/O pin assignment phase: Overlap removal is performed by a gridbased heuristic. I/O pin assignment is performed by minimumweight bipartite matching. Placements generated by the proposed approach are compared with those generated by Cadence Silicon Ensemble and the O-tree floorplanning algorithm. On average, the proposed approach improves both the total wire length and longest wire length by 18.9% and 28.3%, respectively, with an average penalty of 5.6% area overhead.
منابع مشابه
Effective Partition-Driven Placement with Simultaneous Level Processing and Global Net Views
In this paper we take a fresh look at the partition-driven placement (PDP) paradigm for standard-cell placement for wire-length minimization. The goal is to develop several new algorithms for incorporation into a PDP framework that can rectify the well-known drawbacks of traditional PDP (increasingly localized view of nets with increasing levels of the partitioning tree, min-cut objective, inac...
متن کاملMulti-Clustering Net Model for Placement Algorithms
Current placement algorithms aim at routable layouts with shortest wirelength and mostly minimize the total HalfPerimeter Wirelength (HPWL) of nets. A new clustering net model is proposed for better handling of high degree hyperedges, for which the HPWL can significantly underestimate wirelength. Splitting a net into several lower degree subnets, the total HPWL of the subnets estimates wireleng...
متن کاملDRAGON 2000 : STANDARD - CELL PLACEMENT TOOL FOR LARGE INDUSTRYCIRCUITSMaogang
In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem eeectively. A top-down hierarchical approach is used in Dragon2000. State-of-the-art partitioning tools are tightly integrated with wirelength minimization techniques to achieve superior performance. We argue that net-cut minimization is a good and important shortcut to solve the lar...
متن کاملSimultaneous Timing Driven Clustering and Placement for FPGAs
Traditional placement algorithms for FPGAs are normally carried out on a fixed clustering solution of a circuit. The impact of clustering on wirelength and delay of the placement solutions is not well quantified. In this paper, we present an algorithm named SCPlace that performs simultaneous clustering and placement to minimize both the total wirelength and longest path delay. We also incorpora...
متن کاملCongestion Minimization During
| Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is the least understood, however, it models routability most accurately. In this paper, we study the congestion minimization problem during placement. First, we show that a global placement with minimum wirelength has minimum total congestion. We show that minimizing wirelength may (an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. VLSI Syst.
دوره 10 شماره
صفحات -
تاریخ انتشار 2002